# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        def binary_search(nums: List[int], target: int) -> int:
            left = 0
            right = len(nums) - 1

            while left <= right:
                mid = left + (right - left) // 2
                mid_value = nums[mid]

                if target == mid_value:
                    return mid
                elif target < mid_value:
                    right = mid - 1
                else:
                    left = mid + 1

            return -1

        def binary_search_left(nums: List[int], target: int) -> int:
            left = 0
            right = len(nums) - 1

            while left <= right:
                mid = left + (right - left) // 2
                mid_value = nums[mid]

                if target == mid_value:
                    right = mid - 1
                elif target < mid_value:
                    right = mid - 1
                else:
                    left = mid + 1

            return left - 1

        def binary_search_right(nums: List[int], target: int) -> int:
            left = 0
            right = len(nums) - 1

            while left <= right:
                mid = left + (right - left) // 2
                mid_value = nums[mid]

                if target == mid_value:
                    left = mid + 1
                elif target < mid_value:
                    right = mid - 1
                else:
                    left = mid + 1

            return left

        if len(nums) == 0:
            return [-1, -1]

        index = binary_search(nums, target)
        if index == -1:
            return [-1, -1]
        else:
            left = binary_search_left(nums, target)
            right = binary_search_right(nums, target)
            return [left + 1, right - 1]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 4], 4, [1, 1]),
        ([2, 2], 2, [0, 1]),
        ([5, 7, 7, 8, 8, 10], 8, [3, 4]),
        ([5, 7, 7, 8, 8, 10], 6, [-1, -1]),
        ([], 0, [-1, -1])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.searchRange(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

